Orthogonalization-based Iterative Solvers for Generalized Stokes Problems
نویسندگان
چکیده
Two methods for solving the generalized Stokes problems that occur in viscous, incompressible ows are described and tested. Both are based on some type of linear algebraic orthogonaliza-tion process. The rst, EMGS, is a preconditioner derived from an incomplete Gram{Schmidt factorization, and it is proven to exist whenever the matrix being preconditioned can be factored using Gaussian elimination. For M{matrices, EMGS is proven to give a better approximate fac-torization than ILU preconditioning, but this requires a large amount of intermediate storage for computing the preconditioner. The second orthogonalization approach gives a derived system which eliminates the indeeniteness of the generalized Stokes problem, and keeps the velocity eld in the space of discrete null{divergence vectors. Both methods are tested on problems extracted from a nite element uid ow solver.
منابع مشابه
An Investigation into Preconditioning Iterative Solvers for Hydrodynamic Problems
Two Krylov subspace iterative methods, GMRES and QMR, were studied in conjunction with several preconditioning techniques for solving the linear system raised from the finite element discretisation of incompressible Navier-Stokes equations for hydrodynamic problems. The preconditioning methods under investigation were the incomplete factorisation methods such as ILU(0) and MILU, the Stokes prec...
متن کاملAn Iterative Scheme for Generalized Equilibrium, Variational Inequality and Fixed Point Problems Based on the Extragradient Method
The problem ofgeneralized equilibrium problem is very general in the different subjects .Optimization problems, variational inequalities, Nash equilibrium problem and minimax problems are as special cases of generalized equilibrium problem. The purpose of this paper is to investigate the problem of approximating a common element of the set of generalized equilibrium problem, variational inequal...
متن کاملA Simplified and Flexible Variant of GCROT for Solving Nonsymmetric Linear Systems
There is a need for flexible iterative solvers that can solve large-scale (> 106 unknowns) nonsymmetric sparse linear systems to a small tolerance. Among flexible solvers, flexible GMRES (FGMRES) is attractive because it minimizes the residual norm over a particular subspace. In practice, FGMRES is often restarted periodically to keep memory and work requirements reasonable; however, like resta...
متن کاملFast Poisson-based Solvers for Linear and Nonlinear PDEs
Over the last few decades, developing efficient iterative methods for solving discretized partial differential equations (PDEs) has been a topic of intensive research. Though these efforts have yielded many mathematically optimal solvers, such as the multigrid method, the unfortunate reality is that multigrid methods have not been used much in practical applications. This marked gap between the...
متن کاملOn numerical solution of arbitrary symmetric linear systems by approximate orthogonalization
For many important real world problems, after the application of appropriate discretization techniques we can get symmetric and relatively dense linear systems of equations (e.g. those obtained by collocation or projection-like discretization of first kind integral equations). Usually, these systems are rankdefficient and (very) ill-conditioned, thus classical direct or iterative solvers can no...
متن کامل